Indecomposable Coverings with Homothetic Polygons
نویسندگان
چکیده
منابع مشابه
Indecomposable coverings with homothetic polygons
We prove that for any polygon S with at least four sides, and any k > 0, there is a k-fold covering of the plane with homothetic copies of S that can not be decomposed into two coverings.
متن کاملIndecomposable Coverings
We prove that for every k > 1, there exist k-fold coverings of the plane (1) with strips, (2) with axis-parallel rectangles, and (3) with homothets of any fixed concave quadrilateral, that cannot be decomposed into two coverings. We also construct, for every k > 1, a set of points P and a family of disks D in the plane, each containing at least k elements of P , such that no matter how we color...
متن کاملIndecomposable coverings with unit discs
We disprove the 1980 conjecture of János Pach about the cover-decomposability of open convex sets by showing that the unit disc is not cover-decomposable. In fact, our proof easily generalizes to any set with a smooth boundary. We also show that (the suitable variant of) the conjecture holds for unbounded sets. Let C be a collection of sets in R2. We say that C is an m-fold covering if every po...
متن کاملMultiple Coverings with Closed Polygons
A planar set P is said to be cover-decomposable if there is a constant k = k(P ) such that every k-fold covering of the plane with translates of P can be decomposed into two coverings. It is known that open convex polygons are cover-decomposable. Here we show that closed, centrally symmetric convex polygons are also cover-decomposable. We also show that an infinite-fold covering of the plane wi...
متن کاملDecomposition tree and indecomposable coverings
Let G = (V,A) be a directed graph. With any subset X of V is associated the directed subgraph G[X ] = (X,A ∩ (X × X)) of G induced by X . A subset X of V is an interval of G provided that for a, b ∈ X and x ∈ V \ X , (a, x) ∈ A if and only if (b, x) ∈ A, This work was supported, in part, by an NSF EPSCoR grant EPS-0346476 and by a Nebraska Research Initiative (NRI) grant on high performance wir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2015
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-015-9687-9